Earliest arrival flows on series-parallel graphs
نویسندگان
چکیده
We present an exact algorithm for computing an earliest arrival flow in a discrete time setting on series-parallel graphs. In contrast to previous results for the earliest arrival flow problem this algorithm runs in polynomial time.
منابع مشابه
A Survey on Earliest Arrival Flows and a Study of the Series-Parallel Case
Acknowledgement I am most grateful to my Lord and God Jesus Christ who is truly worthy of all praise. I especially praise and thank Him for all His help concerning this work. I am also very grateful to Jun. Prof. Dr. Stefan Ruzika for his help and guidance and especially for his patience. I also thank Heike Sperber for sharing her knowledge of series-parallel graphs with me.
متن کاملEarliest Arrival Flows in Networks with Multiple Sinks
Earliest arrival flows model a central aspect of evacuation planning: In a dangerous situation, as many individuals as possible should be rescued at any point in time. Unfortunately, given a network with multiple sinks, flows over time satisfying this condition do not always exist. We analyze the special case of flows over time with zero transit times and characterize which networks always allo...
متن کاملApproximating Earliest Arrival Flows with Flow-Dependent Transit Times
For the earliest arrival flow problem one is given a network G = (V,A) with capacities u(a) and transit times τ(a) on its arcs a ∈ A, together with a source and a sink vertex s, t ∈ V . The objective is to send flow from s to t that moves through the network over time, such that for each point in time θ ∈ [0, T ) the maximum possible amount of flow reaches t. If, for each θ ∈ [0, T ) this flow ...
متن کاملRandom Information Spread in Networks
Let G = (V,E) be an undirected loopless graph with possible parallel edges and s, t ∈ V . Assume that s is labelled at the initial time step and that every labelled vertex copies its labelling to neighbouring vertices along edges with one labelled endpoint independently with probability p in one time step. In this paper, we establish the equivalence between the expected s-t first arrival time o...
متن کاملComputing earliest arrival flows with multiple sources
Earliest arrival flows are motivated by applications related to evacuation. In typical evacuation situations, the most important task is to get people out of an endangered building or area as fast as possible. Since it is usually not known how long a building can withstand a fire before it collapses or how long a dam can resist a flood before it breaks, it is advisable to organize an evacuation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 57 شماره
صفحات -
تاریخ انتشار 2011